2021-04-11 05:24:26 (CEST) cTI start

% cTI_lt 0.25 using 23.619 MLIPS SICStus 3.8.5 (x86-linux-glibc2.1): Mon Oct 30 16:34:14 CET 2000.
% cTI: Rt=48ms, Wt=45ms. NTI: Rt=0ms, Wt=1ms at most 72 inferences for useful informations.
% NTI summary:  Complete result is optimal.
app(A,B,C)terminates_if b(A);b(C).
    % optimal. loops found: [app([A|_],x,[A|_])]. NTI took    0ms,72i,72i
t(A,B,C)terminates_if true.

% Comparison with termination analyzers
% A termination analyser of identical power would verify
% with the following 4 proofs the 2 inferred conditions:

app(f, f, b).
    % ==> termination proof established
app(b, f, f).
    % ==> termination proof established
app(f, b, f).
    % ==> no proof found
t(f, f, f).
    % ==> termination proof established

Tooltip: You can skip this comparison with termination analyzers by selecting "Comp. skipped" above

Analyzed program:

t(As, Bs, Cs) :-
	cti:{b(As);b(Cs)}, % check this condition
	app(As,Bs,Cs).

app([], As, As).
app([E|Es], Fs, [E|Gs]) :-
	app(Es, Fs, Gs).